Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
نویسندگان
چکیده
This paper describes the design of a fast multi-core library for the cryptographic Tate pairing over supersingular elliptic curves. For the computation of the reduced modified Tate pairing over F3509 , we report calculation times of just 2.94 ms and 1.87 ms on the Intel Core2 and Intel Core i7 architectures, respectively. We also try to answer one important design question that surges: how many cores should be utilized for a given application?
منابع مشابه
Efficient Computations of the Tate Pairingfor the Large MOV Degrees
The Tate pairing has plenty of attractive applications, e.g., ID-based cryptosystems, short signatures, etc. Recently several fast implementations of the Tate pairing has been reported, which make it appear that the Tate pairing is capable to be used in practical applications. The computation time of the Tate pairing strongly depends on underlying elliptic curves and definition fields. However ...
متن کاملEfficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields
After Miller’s original algorithm for the Tate pairing computation, many improved algorithms have been suggested, to name just a few, by Galbraith et al. and Barreto et al., especially for the fields with characteristic three. Also Duursma and Lee found a closed formula of the Tate pairing computation for the fields with characteristic three. In this paper, we show that a similar argument is al...
متن کاملComputation of Tate Pairing for Supersingular Curves over characteristic 5 and 7
We compute Tate pairing over supersingular elliptic curves via the generic BGhES[3] method for p = 5, 7. In those cases, the point multiplication by p is efficiently computed by the Frobenius endomorphism. The function in a cycle can be efficiently computed by the method of continued fraction.
متن کاملOn Efficient Pairings on Elliptic Curves over Extension Fields
In implementation of elliptic curve cryptography, three kinds of finite fields have been widely studied, i.e. prime field, binary field and optimal extension field. In pairing-based cryptography, however, pairingfriendly curves are usually chosen among ordinary curves over prime fields and supersingular curves over extension fields with small characteristics. In this paper, we study pairings on...
متن کاملProject : Supersingular Curves and the Weil Pairing in Elliptic Curve Cryptography
Even first semester calculus students are aware of how calculus, hence analysis, is used to solve problems in engineering. In recent decades the engineering world is gaining more exposure to algebra through the powerful problem solutions it provides. One area that algebra has made significant contributions to is cryptography and, more specifically, public key cryptography. In this paper we aim ...
متن کامل